Performance Comparison of Relaxation Methods with Singular and Nonsingular Preconditioners for Singular Saddle Point Problems
نویسنده
چکیده
In this paper, we first review the PU and Uzawa-SAOR relaxation methods with singular or nonsingular preconditioning matrices for solving singular saddle point problems, and then we provide numerical experiments to compare performance results of the relaxation iterative methods using nonsingular preconditioners with those using singular preconditioners. Mathematics Subject Classification: 65F10, 65F50
منابع مشابه
Acceleration of One-parameter Relaxation Methods for Singular Saddle Point Problems
In this paper, we first introduce two one-parameter relaxation (OPR) iterative methods for solving singular saddle point problems whose semi-convergence rate can be accelerated by using scaled preconditioners. Next we present formulas for finding their optimal parameters which yield the best semi-convergence rate. Lastly, numerical experiments are provided to examine the efficiency of the OPR m...
متن کاملPerformance Analysis of a Special GPIU Method for Singular Saddle Point Problems
In this paper, we first provide semi-convergence analysis for a special GPIU(Generalized Parameterized Inexact Uzawa) method with singular preconditioners for solving singular saddle point problems. We next provide a methodology of how to choose nearly quasi-optimal parameters of the special GPIU method. Lastly, numerical experiments are carried out to examine the effectiveness of the special G...
متن کاملOPINS: An Orthogonally Projected Implicit Null-Space Method for Singular and Nonsingular Saddle-Point Systems∗
Saddle-point systems appear in many scientific and engineering applications. The systems can be sparse, symmetric or nonsymmetric, and possibly singular. In many of these applications, the number of constraints is relatively small compared to the number of unknowns. The traditional null-space method is inefficient for these systems, because it is expensive to find the null space explicitly. Som...
متن کاملThe semi-convergence of GSI method for singular saddle point problems
Recently, Miao and Wang considered the GSI method for solving nonsingular saddle point problems and studied the convergence of the GSI method. In this paper, we prove the semi-convergence of the GSI method when it is applied to solve the singular saddle point problems.
متن کاملSemi-convergence Analysis of the Inexact Uzawa Method for Singular Saddle Point Problems
Recently, various Uzawa methods were proposed based on different matrix splitting for solving nonsingular saddle point problems, and the necessary and sufficient condition of the convergence for those Uzawa methods were derived. Motivated by their results, in this paper we give the semi-convergence analysis of the inexact Uzawa method which is applied to solve singular saddle point problems und...
متن کامل